Optimization based clustering algorithms in Multicast group Hierarchies
نویسندگان
چکیده
In this paper we propose the use of optimization based clustering algorithms to determine hierarchical multicast trees. This problem is formulated as an optimization problem with a non-smooth, non-convex objective function. Different algorithms are examined for solving this problem. Results of numerical experiments using some artificial and real-world databases are reported. We compare several optimization based clustering methods and their combinations with the kmeans method. The results demonstrate the effectiveness of these algorithms.
منابع مشابه
Computer Science at Kent Applying clustering algorithms to multicast group hierarchies
Multicasting offers group communication a considerable efficiency gain, particularly for large groups. As the size of the group increases, management and protocols become more complex and severe scaling problems can arise, for example in the routers at the network layer, for reliable file distribution at the transport layer and for large scale Peer-to-Peer file sharing or processing sharing sys...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملEnergy-Aware Secure Multicast Communication In Wireless Ad-Hoc Networks
In this paper we address the problem of efficiently securing multicast communication in energy constrained wireless ad hoc networks. We show that existing scalable key distribution techniques that rely on logical hierarchies, are energy inefficient. We show that great energy savings can occur when physical location information is considered in the key distribution scheme construction. We also s...
متن کاملClustering and Memory-based Parent-Child Swarm Meta-heuristic Algorithm for Dynamic Optimization
So far, various optimization methods have been proposed, and swarm intelligence algorithms have gathered a lot of attention by academia. However, most of the recent optimization problems in the real world have a dynamic nature. Thus, an optimization algorithm is required to solve the problems in dynamic environments well. In this paper, a novel collective optimization algorithm, namely the Clus...
متن کاملA Clustering Approach by SSPCO Optimization Algorithm Based on Chaotic Initial Population
Assigning a set of objects to groups such that objects in one group or cluster are more similar to each other than the other clusters’ objects is the main task of clustering analysis. SSPCO optimization algorithm is anew optimization algorithm that is inspired by the behavior of a type of bird called see-see partridge. One of the things that smart algorithms are applied to solve is the problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003